Theory of Completeness for Logical Spaces
نویسنده
چکیده
A logical space is a pair of a non-empty set and a subset of , and a deduction pair on is a pair of a subset of and a relation between ∗ and . It will be shown that we can understand the true nature of logical completeness via consideration of those simple notions.
منابع مشابه
SOME RESULTS ON INTUITIONISTIC FUZZY SPACES
In this paper we define intuitionistic fuzzy metric and normedspaces. We first consider finite dimensional intuitionistic fuzzy normed spacesand prove several theorems about completeness, compactness and weak convergencein these spaces. In section 3 we define the intuitionistic fuzzy quotientnorm and study completeness and review some fundamental theorems. Finally,we consider some properties of...
متن کاملRemarks on completeness of lattice-valued Cauchy spaces
We study different completeness definitions for two categories of lattice-valued Cauchy spaces and the relations between these definitions. We also show the equivalence of a so-called completion axiom and the existence of a completion.
متن کاملON COMPACTNESS AND G-COMPLETENESS IN FUZZY METRIC SPACES
In [Fuzzy Sets and Systems 27 (1988) 385-389], M. Grabiec in- troduced a notion of completeness for fuzzy metric spaces (in the sense of Kramosil and Michalek) that successfully used to obtain a fuzzy version of Ba- nachs contraction principle. According to the classical case, one can expect that a compact fuzzy metric space be complete in Grabiecs sense. We show here that this is not the case,...
متن کاملRelationships between completeness of fuzzy quasi-uniform spaces
In this paper, we give a kind of Cauchy 1-completeness in probabilistic quasi-uniform spaces by using 1-filters. Utilizingthe relationships among probabilistic quasi-uniformities, classical quasi-uniformities and Hutton [0, 1]-quasi-uniformities,we show the relationships between their completeness. In fuzzy quasi-metric spaces, we establish the relationshipsbetween the completeness of induced p...
متن کاملVersion Spaces, Structural Descriptions and NP-Completeness
This paper provides a logical analysis of the problem of version space maintenance which highlights fundamental differences between version spaces of boolean concepts and version spaces for structural descriptions. It then employs the theory of NP-completeness in a heuristic manner to isolate a variety of respects in which the standard version space maintenance procedure is intractable in the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Logica Universalis
دوره 3 شماره
صفحات -
تاریخ انتشار 2009